Is Demagnetization an Efficient Optimization Method?
نویسندگان
چکیده
Demagnetization, commonly employed to study ferromagnets, has been proposed as the basis for an optimization tool, a method to find the ground state of a disordered system. Here we present a detailed comparison between the ground state and the demagnetized state in the random field Ising model, combing exact results in d = 1 and numerical solutions in d = 3. We show that there are important differences between the two states that persist in the thermodynamic limit and thus conclude that AC demagnetization is not an efficient optimization method.
منابع مشابه
Investigation of Demagnetization Effect in an Interior V-Shaped Magnet Synchronous Motor at Dynamic and Static Conditions
Permanent magnet motors have been considered for a variety of applications due to their features such as high power density and high efficiency. One of the issues that should be investigated in the design of these motors is the demagnetization problem. Usually, the demagnetization analysis is carried out in a steady state, while demagnetization effect in dynamic condition is more considerable d...
متن کاملAn efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملAn Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005